On Sor Waveform Relaxation Methods
نویسنده
چکیده
Waveform relaxation is a numerical method for solving large-scale systems of ordinary differential equations on parallel computers. It differs from standard iterative methods in that it computes the solution on many time levels or along a continuous time interval simultaneously. This paper deals with the acceleration of the standard waveform relaxation method by successive overrelaxation (SOR) techniques. In particular, different SOR acceleration schemes, based on multiplication with a scalar parameter or convolution with a time-dependent function, are described and theoretically analyzed. The theory is applied to a one-dimensional and two-dimensional model problem and checked against results obtained by numerical experiments.
منابع مشابه
Optimal Convolution Sor Acceleration of Waveform Relaxation with Application to Semiconductor Device Simulation
In this paper we describe a novel generalized SOR algorithm for accelerating the convergence of the dynamic iteration method known as waveform relaxation. A new convolution SOR algorithm is presented, along with a theorem for determining the optimal convolution SOR parameter. Both analytic and experimental results are given to demonstrate that the convergence of the convolution SOR algorithm is...
متن کاملRemarks on the Optimal Convolution Kernel for Csor Waveform Relaxation M. Hu Et Al./ Optimal Convolution Sor Waveform Relaxation 2
The convolution SOR waveform relaxation method is a numerical method for solving large-scale systems of ordinary diierential equations on parallel computers. It is similar in spirit to the SOR acceleration method for solving linear systems of algebraic equations, but replaces the multiplication with an overrelax-ation parameter by a convolution with a time-dependent overrelaxation function. Its...
متن کاملKrylov Subspace Acceleration of Waveform Relaxation
In this paper we describe and analyze Krylov subspace techniques for accelerating the convergence of waveform relaxation for solving time dependent problems. A new class of accelerated waveform methods, convolution Krylov subspace methods, is presented. In particular, we give convolution variants of the conjugate gradient algorithm and two convolution variants of the GMRES algorithm and analyze...
متن کاملRemarks on the optimal convolutionkernel for CSOR waveform
The convolution SOR waveform relaxation method is a numerical method for solving large-scale systems of ordinary diierential equations on parallel computers. It is similar in spirit to the SOR acceleration method for solving linear systems of algebraic equations, but replaces the multiplication with an overrelax-ation parameter by a convolution with a time-dependent overrelaxation function. Its...
متن کاملOn preconditioned Uzawa methods and SOR methods for saddle-point problems
This paper studies convergence analysis of a preconditioned inexact Uzawa method for nondi erentiable saddle-point problems. The SOR-Newton method and the SOR-BFGS method are special cases of this method. We relax the Bramble– Pasciak–Vassilev condition on preconditioners for convergence of the inexact Uzawa method for linear saddle-point problems. The relaxed condition is used to determine the...
متن کامل